Strong Converse, Feedback Channel Capacity and Hypothesis Testing

نویسندگان

  • Po-Ning Chen
  • Fady Alajaji
چکیده

In light of recent results by Verd u and Han on channel capacity, we examine three problems: the strong converse condition to the channel coding theorem, the capacity of arbitrary channels with feedback and the Neyman-Pearson hypothesis testing type-II error exponent. It is rst remarked that the strong converse condition holds if and only if the sequence of normalized channel information densities converges in probability to a constant. Examples illustrating this condition are also provided. A general formula for the capacity of arbitrary channels with output feedback is then obtained. Finally, a general expression for the Neyman-Pearson type-II error exponent based on arbitrary observations subject to a constant bound on the type-I error probability is derived.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Strong converse exponents for the feedback-assisted classical capacity of entanglement-breaking channels

Quantum entanglement can be used in a communication scheme to establish a correlation between successive channel inputs that is impossible by classical means. It is known that the classical capacity of quantum channels can be enhanced by entangled encoding schemes, but this is not always the case. In this paper, we prove that a strong converse theorem holds for the classical capacity of an enta...

متن کامل

Strong converse exponents for a quantum channel discrimination problem and quantum-feedback-assisted communication

We study the difficulty of discriminating between an arbitrary quantum channel and a “replacer” channel that discards its input and replaces it with a fixed state.1 The results obtained here generalize those known in the theory of quantum hypothesis testing for binary state discrimination. We show that, in this particular setting, the most general adaptive discrimination strategies provide no a...

متن کامل

Strong Converse for the Quantum Capacity of the Erasure Channel for Almost All Codes

A strong converse theorem for channel capacity establishes that the error probability in any communication scheme for a given channel necessarily tends to one if the rate of communication exceeds the channel’s capacity. Establishing such a theorem for the quantum capacity of degradable channels has been an elusive task, with the strongest progress so far being a so-called “pretty strong convers...

متن کامل

My title

In this work, we study the tradeoffs between the error probabilities of classical-quantum channels and the blocklength n when the transmission rates approach the channel capacity at a rate slower than 1/ √ n, a research topic known as moderate deviation analysis. We show that the optimal error probability vanishes under this rate convergence. Our main technical contributions are a tight quantum...

متن کامل

Strong Converse Theorems for Multimessage Networks with Tight Cut-Set Bound

This paper proves the strong converse for any discrete memoryless network (DMN) with tight cut-set bound, i.e., whose cut-set bound is achievable. Our result implies that for any DMN with tight cut-set bound and any fixed rate tuple that resides outside the capacity region, the average error probabilities of any sequence of length-n codes operated at the rate tuple must tend to 1 as n grows. Th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016